Deadlocks and Safety Properties
نویسنده
چکیده
منابع مشابه
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties
This paper presents an algorithm for detecting deadlocks in concurrent finite-state systems without incurring most of the state explosion due to the modeling of concurrency by interleaving. For systems that have a high level of concurrency our algorithm can be much more efficient than the classical exploration of the whole state space. Finally, we show that our algorithm can also be used for ve...
متن کاملDesigning Solvable Graphs for Multiple Moving Agents
Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...
متن کاملAnalysis of synchronisation patterns in stateful active objects
This paper presents a static analysis technique based on effect and behavioural types for deriving synchronisation patterns of stateful active objects and verifying their safety – e.g. absence of deadlocks. This is challenging because active objects use futures to refer to results of pending asynchronous invocations and because these futures can be stored in object fields, passed as method para...
متن کاملFencing off Go: Liveness and Safety for Channel-based Programming (extended version)
Go is a production-level statically typed programming languagewhose design features explicit message-passing primitives andlightweight threads, enabling (and encouraging) programmers todevelop concurrent systems where components interact throughcommunication more so than by lock-based shared memory con-currency. Go can only detect global deadlocks at runtime, but pro-vid...
متن کاملSpecification and Analysis of the DCF and PCF Protocols in the 802.11 Standard Using Systems of Communicating Machines
We propose formal models for coordination functions of the 802.11 MAC layer using systems of communicating machines and analyze them. We model the basic DCF (CSMA/CA) protocol, the DCF protocol with RTS/CTS (MACA), and the PCF protocol. Analyses show the following safety results: the CSMA/CA protocol is free from deadlocks and non-executable transitions, the MACA has a potential livelock, but i...
متن کامل